A Voice Activity Detection Algorithm Using Sparse Non-negative Matrix Factorization-based Model Learning in Spectro-Temporal Domain

نویسندگان

چکیده

Voice activity detectors are presented to extract silence/speech segments of the speech signal eliminate different background noise signals. A novel voice detector is proposed in this paper using spectro-temporal features extracted from auditory model signal. After extracting scale, rate, and frequency feature space, a sparse structured principal component analysis algorithm used consider basic components these reduce dimension learning data. Then vectors employed learn models by non-negative matrix factorization algorithm. The procedure performed represent each vector with proper rate based on selected atoms. detection input frames computing energy representation for frame over composite model. If calculated exceeds specified threshold, it indicates that has structure similar atoms learned concludes observed content. results were compared other baseline methods classifiers processing field. These presence stationary, non-stationary periodic noises investigated they shown method can correctly detect activities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noise-Robust Voice Conversion Based on Sparse Spectral Mapping Using Non-negative Matrix Factorization

This paper presents a voice conversion (VC) technique for noisy environments based on a sparse representation of speech. Sparse representation-based VC using Non-negative matrix factorization (NMF) is employed for noise-added spectral conversion between different speakers. In our previous exemplar-based VC method, source exemplars and target exemplars are extracted from parallel training data, ...

متن کامل

Group Sparse Non-negative Matrix Factorization for Multi-Manifold Learning

Many observable data sets such as images, videos and speech can be modeled by a mixture of manifolds which are the result of multiple factors (latent variables). In this paper, we propose a novel algorithm to learn multiple linear manifolds for face recognition, called Group Sparse Non-negative Matrix Factorization (GSNMF). Via the group sparsity constraint imposed on the column vectors of the ...

متن کامل

Learning quantifiable associations via principal sparse non-negative matrix factorization

Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To additionally capture the quantitative association knowledge, Korn et.al. recently propose a paradigm named Ratio Rules [6] for quantifiable data mining. However, their approach is mainly based on Principle Component Analysis (PCA), and as a result, it cannot guarantee that the...

متن کامل

Multimodal voice conversion based on non-negative matrix factorization

A multimodal voice conversion (VC) method for noisy environments is proposed. In our previous non-negative matrix factorization (NMF)-based VC method, source and target exemplars are extracted from parallel training data, in which the same texts are uttered by the source and target speakers. The input source signal is then decomposed into source exemplars, noise exemplars, and their weights. Th...

متن کامل

Single-channel speech separation using sparse non-negative matrix factorization

We apply machine learning techniques to the problem of separating multiple speech sources from a single microphone recording. The method of choice is a sparse non-negative matrix factorization algorithm, which in an unsupervised manner can learn sparse representations of the data. This is applied to the learning of personalized dictionaries from a speech corpus, which in turn are used to separa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of engineering. Transactions B: Applications

سال: 2023

ISSN: ['1728-144X']

DOI: https://doi.org/10.5829/ije.2023.36.08b.08